| Dipole graph | |
|---|---|
| Vertices | 2 |
| Edges | n |
| Diameter | 1 |
| Chromatic number | 2 |
| Chromatic index | n |
In graph theory, a dipole graph (or dipole) is a multigraph consisting of two vertices connected with a number of parallel edges. A dipole graph containing n edges is called the order-n dipole graph, and is denoted by Dn. The order-n dipole graph is dual to the cycle graph Cn.